Virtual Environments for Internet-Based Robots—II: Path Planning

نویسندگان

  • JIACHENG TAN
  • GORDON J. CLAPWORTHY
چکیده

This paper addresses the issue of path planning in a virtual environment (VE) for the control of an Internet-based robot manipulator. A hybrid method is proposed in which the dimension of the path-planning problem is reduced by separating the problem of planning the position of the gripper from that of planning the pose of the gripper. A global configuration-space technique is used for the former and a local operational-space technique is used for the latter. Particular attention is paid to fundamental issues such as mapping the graphical model into configuration space, on-line collision detection and obstacle avoidance in the VE.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

PSO-Based Path Planning Algorithm for Humanoid Robots Considering Safety

In this paper we introduce an improvement in the path planning algorithm for the humanoid soccer playing robot which uses Ferguson splines and PSO (Particle Swarm Optimization). The objective of the algorithm is to find a path through other playing robots to the ball, which should be as short as possible and also safe enough. Ferguson splines create preliminary paths using random generated para...

متن کامل

Formation Control and Path Planning of Two Robots for Tracking a Moving Target

This paper addresses the dynamic path planning for two mobile robots in unknownenvironment with obstacle avoidance and moving target tracking. These robots must form atriangle with moving target. The algorithm is composed of two parts. The first part of thealgorithm used for formation planning of the robots and a moving target. It generates thedesired position for the robots for the next step. ...

متن کامل

Wearable-based evaluation of human-robot interactions in robot path-planning

In Robotics, many path-planning algorithms have been proposed but almost all are evaluated only by their path lengths in PC. However, the evaluation is completely independent of a human ability. Recently, a human intends to live with many robots. For this reason, we should experimentally evaluate many kinds of interactions between a human and robots in our living space, which are supervised by ...

متن کامل

مسیریابی حرکت روبات‌های ماشین‌واره با روش پیشروی سریع

The Robot Motion Planning (RMP) problem deals with finding a collision-free start-to-goal path for a robot navigating among workspace obstacles. Such a problem is also encountered in path planning of intelligent vehicles and Automatic Guided Vehicles (AGVs). In terms of kinematic constraints, the RMP problem can be categorized into two groups of Holonomic and Nonholonomic problems. In the first...

متن کامل

A Path-Planning Algorithm for Multiple Robots in Unknown Environments

This paper describes a new method of path planning for multiple robots in unknown environments. The method, called Space D*, is based on two algorithms: the D*, which is an incremental graph search algorithm, and the Space Colonization algorithm, previously used to simulate crowd behaviors. The path planning is achieved through the exchange of information between the robots. So decentralized, e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003